Verifying Timestamps of Occultation Observation Systems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Verifying Security Protocols with Timestamps via Translation to Timed Automata

In this paper we show a general method of proving authentication and integrity of time dependent security protocols by applying powerful model checking tools originally developed for verifying properties of timed automata. Our approach consists in specifying a security protocol, possibly with timestamps, in a higher-level language and translating automatically the specification to a timed autom...

متن کامل

Partial Observation in Distributed Supervisory Control of Discrete-Event Systems

Distributed supervisory control is a method to synthesize local controllers in discrete-eventsystems with a systematic observation of the plant. Some works were reported on extending this methodby which local controllers are constructed so that observation properties are preserved from monolithic todistributed supervisory control, in an up-down approach. In this paper, we find circumstances in ...

متن کامل

Verifying Hybrid Systems

Hybrid systems are modeled as phase transition systems with sampling semantics. By identifying a set of important events it is ensured that all signiicant state changes are observed, thus correcting previous drawbacks of the sampling computations semantics. A proof rule for verifying properties of hybrid systems is presented and illustrated on several examples.

متن کامل

Skewed Timestamps

In the well known timestamp algorithm each writing process reads all the registers of the other processes, and then sets a higher timestamp (natural number) to itself. In thèskewed algorithm' only one writing process in each pair reads the other. 1 Preface Messages are often timestamped. In a fax, the timestamp includes the date and exact time of the day, and in a book only the publication year...

متن کامل

Flow Timestamps

We consider the problem of a packet multiplexor that receives packets from multiple input flows, then forwards them to a single output channel. The multiplexor ensures a predefined forwarding rate for each flow. This is achieved as follows. The multiplexor assigns a timestamp to each received packet. When the channel becomes idle, the multiplexor forwards the packet with the smallest timestamp....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Publications of the Astronomical Society of Australia

سال: 2015

ISSN: 1323-3580,1448-6083

DOI: 10.1017/pasa.2015.15